All Questions
3 questions
3votes
2answers
310views
UVA 100: “The 3n + 1 problem” take 2
This is my second attempt to solve this problem, my first attempt is here: UVA 100: "The 3n + 1 problem" This time I tried to take lessons from the failures and mistakes You pointed out in ...
- 581
6votes
2answers
829views
UVA 100: "The 3n + 1 problem"
I’ve solved UVA Problem 100: The 3n + 1 problem . In short, the task was to write a program that calculates a maximum of Collatz sequence lengths for any given range of starting values. My program: <...
- 581
5votes
1answer
2kviews
Minimum number of coins - (dynamic programming solution - topdown approach)
This is a problem from topcoder tutorials Given a list of N coins, their values (V1, V2, ... , VN), and the total sum S. Find the minimum number of coins the sum of which is S (we can use as many ...
- 2,726
